On the application of massively parallel SIMD tree machines to certain intermediate-level vision tasks
نویسندگان
چکیده
منابع مشابه
Parallel Game Tree Search on SIMD Machines
We describe an approach to the parallelization of game tree search on SIMD machines. It turns out that the single-instruction restriction of SIMD-machines is not a big obstacle for achieving eeciency. We achieve speedups up to 5850 on a 16K processor MasPar MP-1 if the search trees are suuciently large and if there are no strong move ordering heuristics. To our best knowledge, the largest speed...
متن کاملthe effect of authentic listening materials on the listening proficiency of efl learners in the intermediate level
having conducted the experiment and analysed the data, the researcher computed the groups mean scores and variances for the test relating to the research question. as the final atep, a t-test was conodonted for the hypothesis. as noted earlier, the significance level was determined at .05 and .01 respectively. the observed t-value was higher than the critical t-value at. 5 and .01 levels. conse...
15 صفحه اولParallel Enclosing Rectangle on Simd Machines 1
In this paper, we present a parallel algorithm for nding the smallest enclosing rectangle for a set of n points. The parallel algorithm can be generally implemented on mesh{connected and cube{connected SIMD computers with the time complexity O(p n) and O(log 2 n) respectively .
متن کاملSimultaneous Parallel Reduction on SIMD Machines
Proper distribution of operations among parallel processors in a large scientiic computation executed on a distributed-memory machine can signiicantly reduce the total computation time. In this paper we propose an operation, called simultaneous parallel reduction(SPR), that is amenable to such optimization. SPR performs reduction operations in parallel, each operation reducing a one-dimensional...
متن کاملUnstructured Tree Search on SIMD Parallel Computers
In this paper, we present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An e cient formulation of tree search on a SIMD machine comprises of two major components: (i) a triggering mechanism, which determines when the search space redistribution must occur to balance search space ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision, Graphics, and Image Processing
سال: 1986
ISSN: 0734-189X
DOI: 10.1016/s0734-189x(86)80029-9